Transition based neural network dependency parsing of Tibetan

نویسندگان

چکیده

In order to improve the performance of Tibetan natural language processing applications such as machine translation, sentiment analysis and other tasks, this article proposes a neural network-based method for syntactic dependence. Part corpus Qinghai Normal University’s part-of-speech tag set is marked by corresponding mapping relationship transformed into annotated national standard set. At same time, CoNLL format dependency syntax tree library constructed, shift-reduce plus network adopted systematically study analyze syntax. Thereby improving quality analysis, its accuracy rate reaches UAS:94.59%

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transition-based Dependency Parsing Using Recursive Neural Networks

In this work, we present a general compositional vector framework for transitionbased dependency parsing. The ability to use transition-based algorithms allows for the application of vector composition to a large set of languages where only dependency treebanks are available, as well as handling linguistic phenomena such as non-projectivities which pose problems for previously proposed methods....

متن کامل

Probabilistic Graph-based Dependency Parsing with Convolutional Neural Network

This paper presents neural probabilistic parsing models which explore up to thirdorder graph-based parsing with maximum likelihood training criteria. Two neural network extensions are exploited for performance improvement. Firstly, a convolutional layer that absorbs the influences of all words in a sentence is used so that sentence-level information can be effectively captured. Secondly, a line...

متن کامل

Graph-Based Dependency Parsing with Recursive Neural Network

Graph-based dependency parsing models have achieved state-of-theart performance, yet their defect in feature representation is obvious: these models enforce strong independence assumptions upon tree components, thus restricting themselves to local, shallow features with limited context information. Besides, they rely heavily on hand-crafted feature templates. In this paper, we extend recursive ...

متن کامل

An Effective Neural Network Model for Graph-based Dependency Parsing

Most existing graph-based parsing models rely on millions of hand-crafted features, which limits their generalization ability and slows down the parsing speed. In this paper, we propose a general and effective Neural Network model for graph-based dependency parsing. Our model can automatically learn high-order feature combinations using only atomic features by exploiting a novel activation func...

متن کامل

Transition-Based Parsing for Deep Dependency Structures

Derivations under different grammar formalisms allow extraction of various dependency structures. Particularly, bilexical deep dependency structures beyond surface tree representation can be derived from linguistic analysis grounded by CCG, LFG, and HPSG. Traditionally, these dependency structures are obtained as a by-product of grammar-guided parsers. In this article, we study the alternative ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: MATEC web of conferences

سال: 2021

ISSN: ['2261-236X', '2274-7214']

DOI: https://doi.org/10.1051/matecconf/202133606018